Factoring Groups Efficiently
نویسندگان
چکیده
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two subgroups A and B of G such that G is the direct product of A and B, if such a decomposition exists.
منابع مشابه
QIP Note: On the Quantum Fourier Transform and Applications
This note introduces Fourier transforms over finite Abelian groups, and shows how this can be used to find the period of any efficiently computable periodic function. This in particular implies an efficient quantum algorithm for factoring. In the appendix we show how this generalizes to solving the hidden subgroup problem in any Abelian group. Efficient quantum algorithms for discrete log (and ...
متن کاملDecomposing finite Abelian groups
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).
متن کاملThe Generic Hardness of Subset Membership Problems under the Factoring Assumption
We analyze a large class of subset membership problems related to integer factorization. We show that there is no algorithm solving these problems efficiently without exploiting properties of the given representation of ring elements, unless factoring integers is easy. Our results imply that problems with high relevance for a large number of cryptographic applications, such as the quadratic res...
متن کاملCSE 599d - Quantum Computing Shor’s Algorithm
The efficient factoring of numbers is a problem that has attracted the attention of humankind for probably as long as we have contemplated numbers. Indeed, today the most widely used system used to communicate securely over the internet has its security based on the difficulty of factoring numbers efficiently. A great deal of effort has been spent trying to find classical algorithms to factor n...
متن کاملNew Constructions and Applications of Trapdoor DDH Groups
Trapdoor Decisional Diffie-Hellman (TDDH) groups, introduced by Dent and Galbraith (ANTS 2006), are groups where the DDH problem is hard, unless one is in possession of a secret trapdoor which enables solving it efficiently. Despite their intuitively appealing properties, they have found up to now very few cryptographic applications. Moreover, among the two constructions of such groups proposed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 15 شماره
صفحات -
تاریخ انتشار 2008